Using Strings for On-Line Handwriting Shape Matching: A New Weighted Edit Distance
نویسندگان
چکیده
Edit Distance has been widely studied and successfully applied in a large variety of application domains and many techniques based on this concept have been proposed in the literature. These techniques share the property that, in case of patterns having different lengths, a number of symbols are introduced in the shortest one, or deleted from the longest one, until both patterns have the same length. In case of applications in which strings are used for shape description, however, this property may introduce distortions in the shape, resulting in a distance measure not reflecting the perceived similarity between the shapes to compare. Moving from this consideration, we propose a new edit distance, called Weighted Edit Distance that does not require the introduction or the deletion of any symbol. Preliminary experiments performed by comparing our technique with the Normalized Edit Distance and the Markov Edit Distance have shown very encouraging results.
منابع مشابه
Practical Methods for Approximate String Matching
Given a pattern string and a text, the task of approximate string matching is to find all locations in the text that are similar to the pattern. This type of search may be done for example in applications of spelling error correction or bioinformatics. Typically edit distance is used as the measure of similarity (or distance) between two strings. In this thesis we concentrate on unit-cost edit ...
متن کاملReprésentation par graphe de mots manuscrits dans les images pour la recherche par similarité
Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labeled vertexes are established for connected components. Ea...
متن کاملReprésentation des mots manuscrits par graphe pour la recherche par similarité
Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word-spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labeled vertexes are established for connected components. Ea...
متن کاملContour-Based Shape Retrieval Using Dynamic Time Warping
A dissimilarity measure for shapes described by their contour, the Cyclic Dynamic Time Warping (CDTW) dissimilarity, is introduced. The dissimilarity measure is based on Dynamic Time Warping of cyclic strings, i.e., strings with no definite starting/ending points. The Cyclic Edit Distance algorithm by Maes cannot be directly extended to compute the CDTW dissimilarity, as we show in the paper. W...
متن کاملA Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, which are founded on a window-constrained edit graph related to the strings involved. Weights are the ones which minimize the sum of squared relative errors of the weighted solution with respect to exact values, on a tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005